Java 19: More algorithms and data structures by Poul Klausen

Author:Poul Klausen
Language: eng
Format: epub
Publisher: Bookboon.com Ltd.
Published: 2018-10-21T00:00:00+00:00

If a pointer P points to a node, the following requirements must be met:

if P is the first pointer all values X in the sub-tree, that P points on must meet

if P is the last pointer all values X in the sub-tree, that P points on must meet

if P is the ith pointer where 1 < i < m must all values X in the sub-tree, that P points on meet

Note the last blank area in the above figure, which will illustrate that a node is not necessarily filled, that means that m < n. A 2-3-4 tree is thus a search tree of the order 4. As an example, the figure below illustrates a search tree, where the gray boxes illustrate zero pointers:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.